Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Traitement requête")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 316

  • Page / 13
Export

Selection :

  • and

On the optimal nesting order for computing N-relational joinsIBARAKI, T; KAMEDA, T.ACM transactions on database systems. 1984, Vol 9, Num 3, pp 482-502, issn 0362-5915Article

The tree projection theorem and relational query processingGOODMAN, N; SHMUELI, O.Journal of computer and system sciences (Print). 1984, Vol 28, Num 1, pp 60-79, issn 0022-0000Article

Asserting the optimality of serial SJRPS in processing simple queries in chain networksGURSEL, G; SCHEUERMANN, P.Information processing letters. 1984, Vol 19, Num 5, pp 255-260, issn 0020-0190Article

Pathstack : A holistic path join algorithm for path query with not-predicates on XML dataENHUA JIAO; TOK WANG LING; CHAN, Chee-Yong et al.Lecture notes in computer science. 2005, pp 113-124, issn 0302-9743, isbn 3-540-25334-3, 12 p.Conference Paper

Extended nested relationsHERNANDEZ, H. J.Acta informatica. 1993, Vol 30, Num 8, pp 741-771, issn 0001-5903Article

An optimal algorithm for processing distributed star queriesCHEN, A. L. P; LI, V. O. K.IEEE transactions on software engineering. 1985, Vol 11, Num 10, pp 1097-1107, issn 0098-5589Article

Query processing in TREC6LU, A; MEIER, E; RAO, A et al.NIST special publication. 1998, Num 500240, pp 567-576, issn 1048-776XConference Paper

Query term expansion based on paragraphs of the relevant documentsISHIKAWA, K; SATOH, K; OKUMURA, A et al.NIST special publication. 1998, Num 500240, pp 577-584, issn 1048-776XConference Paper

Bases de données réparties = Distributed databaseCHRISMENT, Claude; PUJOLLE, Geneviève; ZURFLUH, Gilles et al.Techniques de l'ingénieur. Informatique. 1993, Vol HB4, Num H3850, pp H3850.1-H3850.14, issn 0245-9612Article

MAKING THE MOST OF YOUR MICRO.KHANNA V; DALY T.1975; DIGIT. DESIGN; U.S.A.; DA. 1975; VOL. 5; NO 7; PP. 36-49 (8P.)Article

High-volume continuous XPath querying in XML message brokers : Knowledge-based software engineeringLEE, Hyunho; LEE, Wonsuk.IEICE transactions on information and systems. 2006, Vol 89, Num 4, pp 1359-1367, issn 0916-8532, 9 p.Conference Paper

Selection of materialized relations in ontology repository management systemMAN LI; XIAOYONG DU; SHAN WANG et al.Lecture notes in computer science. 2006, pp 241-251, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 11 p.Conference Paper

Just askInformation outlook. 2006, Vol 10, Num 4, pp 33-35, issn 1091-0808, 3 p.Article

Estimating recall and precision for vague queries in databasesKOLITSKI STASIU, Raquel; HEUSER, Carlos A; DA SILVA, Roberto et al.Lecture notes in computer science. 2005, pp 187-200, issn 0302-9743, isbn 3-540-26095-1, 14 p.Conference Paper

COCACHE : Query processing based on collaborative caching in P2P systemsWEINING QIAN; LINHAO XU; SHUIGENG ZHOU et al.Lecture notes in computer science. 2005, pp 498-510, issn 0302-9743, isbn 3-540-25334-3, 13 p.Conference Paper

Finding level-ancestors in treesBERKMAN, O; VISHKIN, U.Journal of computer and system sciences (Print). 1994, Vol 48, Num 2, pp 214-230, issn 0022-0000Article

ALPHA et QUEL : évaluation des langages et traitement des requêtes (décomposition et optimisation) = ALPHA and QUEL: evaluation of languages and queries processing (Decomposition and optimisation)BOUMGHAIT, Mohammed.1984, 174 pThesis

Efficient non-blocking top-k query processing in distributed networksBO DENG; YAN JIA; SHUQIANG YANG et al.Lecture notes in computer science. 2006, pp 880-889, issn 0302-9743, isbn 3-540-33337-1, 1Vol, 10 p.Conference Paper

Reuse or never reuse the deleted labels in XML query processing based on labeling schemesCHANGQING LI; TOK WANG LING; MIN HU et al.Lecture notes in computer science. 2006, pp 659-673, issn 0302-9743, isbn 3-540-33337-1, 1Vol, 15 p.Conference Paper

Twigstacklist¬ : A holistic twig join algorithm for twig query with not-predicates on XML dataTIAN YU; TOK WANG LING; JIAHENG LU et al.Lecture notes in computer science. 2006, pp 249-263, issn 0302-9743, isbn 3-540-33337-1, 1Vol, 15 p.Conference Paper

Novel multimedia retrieval technique: progressive query (why wait?) : Technologies for interactive multimedia servicesKIRANYAZ, S; GABBOUJ, M.IEE proceedings. Vision, image and signal processing. 2005, Vol 152, Num 3, pp 356-366, issn 1350-245X, 11 p.Article

A full pattern-based paradigm for XML query processingBENZAKEN, Véronique; CASTAGNA, Giuseppe; MIACHON, Cédric et al.Lecture notes in computer science. 2005, pp 235-252, issn 0302-9743, isbn 3-540-24362-3, 18 p.Conference Paper

On the usage of global document occurrences in peer-to-peer information systemsPAPAPETROU, Odysseas; MICHEL, Sebastian; BENDER, Matthias et al.Lecture notes in computer science. 2005, pp 310-328, issn 0302-9743, isbn 3-540-29736-7, 2Vol, 19 p.Conference Paper

Toward efficient multifeature query processingJAGADISH, H. V; BENG CHIN OOI; HENG TAO SHEN et al.IEEE transactions on knowledge and data engineering. 2006, Vol 18, Num 3, pp 350-362, issn 1041-4347, 13 p.Article

A relaxed approach to RDF queryingHURTADO, Carlos A; POULOVASSILIS, Alexandra; WOOD, Peter T et al.Lecture notes in computer science. 2006, pp 314-328, issn 0302-9743, isbn 3-540-49029-9, 1Vol, 15 p.Conference Paper

  • Page / 13